The Borell-ehrhard Game
نویسنده
چکیده
A precise description of the convexity of Gaussian measures is provided by sharp Brunn-Minkowski type inequalities due to Ehrhard and Borell. We show that these are manifestations of a game-theoretic mechanism: a minimax variational principle for Brownian motion. As an application, we obtain a Gaussian improvement of Barthe’s reverse Brascamp-Lieb inequality.
منابع مشابه
Forgetting causality in the concurrent game semantics of probabilistic PCF
We enrich thin concurrent games with symmetry, recently introduced by Castellan et al, with probabilities, and build on top of it a cartesian closed category with an interpretation of Probabilistic PCF (PPCF). Exploiting that the strategies obtained from PPCF terms have a deadlock-free interaction, we deduce that there is a functor preserving the interpretation from our games to the probabilist...
متن کاملSequential algorithms and strongly stable functions
Intuitionistic proofs (or PCF programs) may be interpreted as functions between domains, or as strategies on games. The two kinds of interpretation are inherently different: static vs. dynamic, extensional vs. intentional. It is extremely instructive to compare and to connect them. In this article, we investigate the extensional content of the sequential algorithm hierarchy [−]SDS introduced by...
متن کاملNon uniform (hyper/multi)coherence spaces
In (hyper)coherence semantics, proofs/terms are cliques in (hyper)graphs. Intuitively, vertices represent results of computations and the edge relation witnesses the ability of being assembled into a same piece of data or a same (strongly) stable function, at arrow types. In (hyper)coherence semantics, the argument of a (strongly) stable functional is always a (strongly) stable function. As a c...
متن کامل